Sufficient Conditions for Convergence of Loopy Belief Propagation
نویسندگان
چکیده
We derive novel sufficient conditions for convergence of Loopy Belief Propagation (also known as the Sum-Product algorithm) to a unique fixed point. Our results improve upon previously known conditions. For binary variables with (anti-)ferromagnetic interactions, our conditions seem to be sharp.
منابع مشابه
Message Error Analysis of Loopy Belief Propagation for the Sum-Product Algorithm
Belief propagation is known to perform extremely well in many practical statistical inference and learning problems using graphical models, even in the presence of multiple loops. The use of the belief propagation algorithm on graphical models with loops is referred to as Loopy Belief Propagation (LBP). Various sufficient conditions for convergence of LBP have been presented; however, general n...
متن کاملLoopy Belief Propogation and Gibbs Measures
We address the question of convergence in the loopy belief propagation (LBP ) algorithm. Specifically, we relate convergence of LBP to the existence of a weak limit for a sequence of Gibbs measures defined on the LBP 's associ ated computation tree. Using tools from the theory of Gibbs measures we develop easily testable sufficient conditions for convergence. The failure of convergence of LBP ...
متن کاملSufficient conditions for convergence of the Sum-Product Algorithm
Novel conditions are derived that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages, for parallel (synchronous) updates. The computational complexity of the conditions is polynomial in the number of variables. In contrast with previously existing conditions, our r...
متن کاملCorrectness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
Graphical models, such as Bayesian networks and Markov random fields, represent statistical dependencies of variables by a graph. Local "belief propagation" rules of the sort proposed by Pearl (1988) are guaranteed to converge to the correct posterior probabilities in singly connected graphs. Recently, good performance has been obtained by using these same rules on graphs with loops, a method w...
متن کاملOn the Uniqueness of Loopy Belief Propagation Fixed Points
We derive sufficient conditions for the uniqueness of loopy belief propagation fixed points. These conditions depend on both the structure of the graph and the strength of the potentials and naturally extend those for convexity of the Bethe free energy. We compare them with (a strengthened version of) conditions derived elsewhere for pairwise potentials. We discuss possible implications for con...
متن کامل